Using BDDs to Implement Propositional Modal Tableaux
نویسنده
چکیده
We present a method for using Binary Decision Diagrams (BDDs) to implement the tableau method of automated reasoning for propositional modal logics K and S4. We evaluate an implementation of such a reasoner that uses BDDs as the basic data structure. We show, with comparison to FaCT++ and InKreSAT, that it can compete with other state of the art methods of reasoning in propositional modal logic.
منابع مشابه
BDDs and Automated Deduction
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists. We give an overview of BDDs from an automated deduction perspective, showing what can be done with them in propositional and first-order logic, and discuss the parallels to well-known methods like tableaux and resolu...
متن کاملImplementing Tableaux by Decision Diagrams
Binary Decision Diagrams (BDDs) are usually thought of as devices engineered specially for classical propositional logic. We show that we can build on one of their variants, Minato's zero-suppressed BDDs, to build compact data structures that encode whole tableaux. We call these structures tableaux decision diagrams (TDDs), and show how tableaux proof search is implemented in this framework. Fo...
متن کاملFree Variable Tableaux for Propositional Modal Logics Universit at Karlsruhe Fakult at F Ur Informatik Free Variable Tableaux for Propositional Modal Logics
We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain \free" and \universal" variables. Our \lean" Prolog implementation is not only surprisingly short, but compares favourably with other considerably more complex implementations for modal deduction.
متن کاملA Simple Tableau System for the Logic of Elsewhere
We analyze different features related to the mechanization of von Wright’s logic of elsewhere E . First, we give a new proof of the NP-completeness of the satisfiability problem (giving a new bound for the size of models of the satisfiable formulae) and we show that this problem becomes linear-time when the number of propositional variables is bounded. Although E and the well-known propositiona...
متن کاملFree Variable Tableaux for Propositional Modal Logics
Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariables used during proof search. We present the theoretical foundations to extend this technique to propositional modal logics, including non-trivial rigorous proofs of soundness and completeness, and also present various ...
متن کامل